Guaranteeing X in Y: On-line Acceptance Tests for Hard Aperiodic Tasks Scheduled by the Slack Stealing Algorithm
نویسنده
چکیده
In this paper, we show that two recently published on-line acceptance tests for guaranteeing hard deadline aperiodic tasks scheduled under the Slack Stealing algorithm are insufficient: they may guarantee tasks which will then miss their deadlines. Further, we derive a sufficient acceptance test which is both efficient and effective. An evaluation of the performance of this acceptance test is given in the paper.
منابع مشابه
Firm Aperiodic Task Scheduling in Hard Real-time Multiprocessor Systems
The problem of extending monoprocessor methods to multiprocessors for scheduling soft aperiodic tasks has been addressed and evaluated in previous works, where the most usual goal for aperiodic tasks is minimising response times. This paper introduces a new problem where the goal for aperiodic tasks is guaranteeing their deadlines. Guaranteeing aperiodic deadlines is done using an acceptance te...
متن کاملOn accepting aperiodic transactions in distributed systems
In this paper we present algorithms for jointly scheduling periodic tasks and hard aperiodic tasks with precedence relations in a distributed systems under the earliest deadline first algorithm. The periodic distributed processes are assumed to be guaranteed off-line and decomposed into a set of independent tasks by means of release time and deadline modifications. This paper proposes a similar...
متن کاملOptimal Priority Assignment for Aperiodic Tasks with Firm Deadlines in Fixed Priority Pre-Emptive Systems
An optimal priority assignment policy is presented for independent aperiodic tasks with arbitrary ready times and firm deadlines, scheduled on a uniprocessor along with a set of hard periodic/sporadic tasks. The latter tasks are assumed to have been assigned unique fixed priorities according to some arbitrary policy and guaranteed, via off-line feasibility analysis, to meet their deadlines. In ...
متن کاملScheduling of hard-aperiodic requests in dynamic priority systems
In this paper, we discuss the problem of jointly scheduling both hard deadline of periodic and aperiodic tasks in dynamic priority systems. The proposed scheduling scheme has extended the APS (Alternative Priority Scheduling) algorithm which is developed by the authors. The APS algorithm has a simple slcak calculation method which in consequence makes it be practical. The paper develops an effi...
متن کاملDual Priority Algorithm to Schedule Real-Time Tasks in a Shared Memory Multiprocessor
In this paper we present an adaptation of the Dual Priority Scheduling Algorithm to schedule both hard realtime periodic tasks and soft-aperiodic tasks in shared memory multiprocessor systems. The goal is to achieve low mean aperiodic response times while meeting all periodic task deadlines. Our proposal allows periodic and aperiodic tasks to migrate to other processors to improve aperiodic mea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994